Bast Modular Arithmetic Algorithm Using a Residue Table

نویسنده

  • Kyoko HIRANO
چکیده

(EXTENDED ABSTRACT) Shin-ichi KAWAMURA and Kyoko HIRANO TOSHIBA CORPORATION RESEARCH AND DEVELOPMENT CENTER

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Redundant Residue Number System Based Fault Tolerant Architecture over Wireless Network

Wireless communication has become an indispensable part of our lives by improving interaction demands relating within our environment. The result of interference of information passing through different systems often caused by noise reduces the completeness of the information or data received. A Fault-tolerant mechanism for wireless networks is of utmost importance to be devised due to the use ...

متن کامل

A Multi-layer Recursive Residue Number System

We present a method to increase the dynamical range of a Residue Number System (RNS) by adding virtual RNS layers on top of the original RNS, where the required modular arithmetic for a modulus on any non-bottom layer is implemented by means of an RNS Montgomery multiplication algorithm that uses the RNS on the layer below. As a result, the actual arithmetic is deferred to the bottom layer. The...

متن کامل

An IWS Montgomery Modular Multiplication Algorithm

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to mixed radix, and is performed using a Residue Number System. By choosing the moduli of the RNS system reasonably large, and implementing the system on a ring of fairly simple processors, the carry-free nature of RNS arithmetic achieves an eeect corresponding to a redunda...

متن کامل

An RNS Montgomery Modular Multiplication Algorithm

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to mixed radix, and is performed using a Residue Number System. By choosing the moduli of the RNS system reasonably large and implementing the system on a ring of fairly simple processors, an effect corresponding to a redundant high-radix implementation is achieved. The alg...

متن کامل

Montgomery Modular Multiplication in Residue Arithmetic

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to residue arithmetic. By choosing the moduli of the RNS system reasonably large, an eeect corresponding to a redundant high-radix implementation is achieved, due to the carry-free nature of residue arithmetic. The actual computation in the multiplication takes place in con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007